Online Task Assignment Problems with Reusable Resources

We study online task assignment problem with reusable resources, motivated by practical applications such as ridesharing, crowdsourcing and job hiring. In the problem, we are given a set of offline vertices (agents), and, at each time, an vertex (task) arrives randomly according to known time-dependent distribution. Upon arrival, assign agents immediately irrevocably. The goal is maximize expected total profit produced completed tasks. key features our (1) agent reusable, i.e., comes back market after completing assigned task, (2) may reject stay market, (3) accommodate multiple agents. setting generalizes that existing work in which one under (1). this paper, propose algorithm 1/2-competitive for above setting, tight. Moreover, when can tasks most Δ times, shown have competitive ratio Δ/(3Δ-1), least 1/3. also evaluate proposed numerical experiments.